Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm

نویسندگان

  • Laurent Dupont
  • Daniel Lazard
  • Sylvain Lazard
  • Sylvain Petitjean
چکیده

We present the first exact and efficient algorithm for computing a proper parametric representation of the intersection of two quadrics in three-dimensional real space given by implicit equations with rational coefficients. The output functions parameterizing the intersection in projective space are polynomial, whenever it is possible, which is the case when the intersection is not a smooth quartic (for example, a singular quartic, a cubic and a line, and two conics). Furthermore, the parameterization is near-optimal in the sense that the number of distinct square roots appearing in the coefficients of these functions is minimal, except in a small number of well-identified cases where there may be an extra square root. In addition, the algorithm is practical: a complete, robust and efficient C++ implementation is described in Lazard et al. (2006). In Part I, we present an algorithm for computing a parameterization of the intersection of two arbitrary quadrics which we prove to be near-optimal in the generic, smooth quartic, case. Parts II and III treat the singular cases. We present in Part II the first classification of pencils of quadrics according to the real type of the intersection and we show how this classification can be used to efficiently determine the type of the real part of the intersection of two arbitrary quadrics. This classification is at the core of the design of our algorithms for computing near-optimal parameterizations of the real part of the intersection in all singular cases. We present these algorithms in Part III and give examples covering all the possible situations in terms of both the real type of intersection and the number and depth of square roots appearing in the coefficients.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections

We conclude, in this third part, the presentation of an algorithm for computing an exact and proper parameterization of the intersection of two quadrics. The coordinate functions of the parameterizations in projective space are polynomial, whenever it is possible. They are also near-optimal in the sense that the number of distinct square roots appearing in the coefficients of these functions is...

متن کامل

Contributions au calcul géométrique effectif avec des objets courbes de faible degré. (Contributions to effective geometric computing with low-degree curved objects)

We present the first efficient algorithm for computing an exact parametric representationof the intersection of two quadrics in three-dimensional real space given by implicit equations withrational coefficients. The output functions parameterizing the intersection are rational functionswhenever it is possible, which is the case when the intersection is not a smooth quartic (for exam...

متن کامل

Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils

While Part I [2] of this paper was devoted mainly to quadrics intersecting in a smooth quartic, we now focus on singular intersections. To produce optimal or near-optimal parameterizations in all cases, we first determine the the real type of the intersection before computing the actual parameterization. In this second part, we present the first classification of pencils of quadrics based on th...

متن کامل

Near-Optimal Parameterization of the Intersection of Quadrics: IV. An Efficient and Exact Implementation

We present the first complete, robust, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It is based on the near-optimal algorithm presented in Parts I, II, and III [5, 6, 7] of this paper. Our implementation correctly identifies and parameterizes all the algebraic components of the intersection in all case...

متن کامل

Conversion CSG-BRep de scènes définies par des quadriques. (Boundary evaluation of scenes defined by quadrics)

The objective of this thesis is to investigate the problem of boundary evaluation, which transforms the CSG model of a scene to its BRep corresponding model, for scenes defined by quadrics. This algorithm consists of four steps : (i) the parameterization of every intersection curve between quadrics ; (ii) the calculation of the intersection points between such curves and the quadrics ; (iii) th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2008